Truly Selective Refinement of Progressive Meshes
نویسندگان
چکیده
This paper presents a novel selective refinement scheme of progressive meshes. In previous schemes, topology information in the neighborhood of a collapsed edge is stored in the analysis phase. A vertex split or edge collapse transformation is possible in the synthesis phase only if the configuration of neighborhood vertices in the current mesh corresponds to the stored topology information. In contrast, the proposed scheme makes it possible to apply a vertex split or an edge collapse to any selected vertex or edge in the current mesh without a precondition. Our main observation is that the concept of a dual piece can be used to clearly enumerate and visualize the set of all possible selectively refined meshes for a given mesh. Our refinement scheme is truly selective in the sense that each vertex split or edge collapse can be performed without incurring additional vertex split and/or edge collapse transformations.
منابع مشابه
Transitive Mesh Space of a Progressive Mesh
This paper investigates the set of all selectively refined meshes that can be obtained from a progressive mesh. We call the set the transitive mesh space of a progressive mesh and present a theoretical analysis of the space. We define selective edge collapse and vertex split transformations, which we use to traverse all selectively refined meshes in the transitive mesh space. We propose a compl...
متن کاملView-dependent Mesh Streaming with Minimal Latency
This paper presents a novel framework for view-dependent streaming of multiresolution meshes. In contrast to conventional progressive streaming in which the resolution of a model changes globally, our server dynamically adjusts the transmission order of the detail data with respect to the client’s current viewpoint. By extending the truly selective refinement scheme for progressive meshes to a ...
متن کاملConstructing and Rendering of Multiresolution Representation for Massive Meshes with GPU and Mesh Layout
Multiresolution technique is one of the most efficient approaches to improve the rendering performance, but its design and implementation for massive meshes are still very difficult. This paper researches and realizes constructing and rendering of multiresolution representation for massive meshes base on surface partition, which could provide vertex-grained local refinement and generate the opt...
متن کاملTruly selective polygonal mesh hierarchies with error control
In this work a new multi-resolution model is proposed for polygonal meshes. It is based on the dual edge collapse, which performs face clustering instead of vertex clustering. The new hierarchical mesh representation combines a truly selective refinement scheme with a strict control of the two-sided Hausdorff distance. The proposed approach allows to build hierarchical meshes directly over non ...
متن کاملIrregular to Completely Regular Meshing in Computer Graphics
Irregular to Completely Regular Meshing in Computer Graphics This talk will provide a quick overview of meshing structures used in computer graphics. Maximizing rendering performance is a key goal, and irregular meshes provide the greatest geometric fidelity for a given mesh complexity. Level-ofdetail representations like progressive meshes allow selective refinement of such meshes even in real...
متن کامل